排序方式: 共有47条查询结果,搜索用时 15 毫秒
31.
对于简单图G=〈V,E〉,如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1}满足:1)对任意的u,v∈V,若u≠v,则f(u)≠f(v);2)max{f(v)|v∈V}=2|E|-1;3)对任意的e_1,e_2∈E,若e_1≠e_2,则g(e_1)≠g(e_2),此处g(e)=|f(u)+f(v)|,e=uv;4)|g(e)|e∈E}={1,3,5,…,2|E|-1},则称G为奇优美图,f称为G的奇优美标号.设G=〈V,E〉是一个无向简单图.如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1},满足:1)f是单射;2)■uv∈E(G),令f(uv)=f(u)+f(v),有{f(uv)|uv∈E(G)}={1,3,5,…,2|E|-1},则称G是奇强协调图,f称为G的.奇强协调标号或奇强协调值.给出了链图、升降梯等几类有趣图的奇优美标号和奇强协调标号. 相似文献
32.
关于图P_n~3优美性的研究 总被引:1,自引:0,他引:1
在n个顶点的路Pn上,当且仅当两点的距离为3时增加一条边,所得的图称为P3n,本文给出了图P3n(n≥4)的优美标号,从而证明了P3n都是优美图. 相似文献
33.
A simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given cycle C. Then the graph G is C-magic if there exists a total labelling f:V∪E→{1,2,…,|V|+|E|} such that, for every subgraph H′=(V′,E′) of G isomorphic to C, ∑v∈V′f(v)+∑e∈E′f(e) is constant. When f(V)={1,…,|V|}, then G is said to be C-supermagic.We study the cyclic-magic and cyclic-supermagic behavior of several classes of connected graphs. We give several families of Cr-magic graphs for each r?3. The results rely on a technique of partitioning sets of integers with special properties. 相似文献
34.
In this paper, a new definition on harmonious dissipative operators is given and some important properties of theirs are shown. Especially, the relationship between a harmonious dissipative operator and the completely square conservative difference scheme in an explicit way is revealed. Kinds of 2-order, 3-order and 4-order harmonious dissipative operators are constructed by using the traditional Runge-Kutta method and a species of general m-order harmonious dissipative operators is established in the linear case. In addition, an efficiency parameter to appraise the time benefits of a harmonious dissipative operator is defined in this paper. It is testified in numerical tests that the harmonious dissipative operators are indeed able to improve the time-efficiency and computational effect of the completely square conservative difference scheme in an explicit way. 相似文献
35.
关于奇强协调图的一些结果 总被引:1,自引:1,他引:0
刘广军 《数学的实践与认识》2013,43(11)
对于一个(p,q)-图G,如果存在一个单射f:V(G)→{0,1,…,2q-1},使得边标号集合{f(uv)|uv∈E(G)}={1,3,5,…,2q-1},其中边标号为f(uv)=f(u)+f(v),那么称G是奇强协调图,并称f是G的一个奇强协调标号.通过研究若干奇强协调图,得出一些奇强协调图的性质. 相似文献
36.
Ryan C. Bunge Avapa Chantasartrassmee Saad I. El-Zanati Charles Vanden Eynden 《Journal of Graph Theory》2013,72(1):90-111
We introduce two new labelings for tripartite graphs and show that if a graph G with n edges admits either of these labelings, then there exists a cyclic G‐decomposition of for every positive integer x. We also show that if G is the union of two vertext‐disjoint cycles of odd length, other than , then G admits one of these labelings. 相似文献
37.
In this review article, we will summarize the main advances in network science investigated by the CIAE Group of Complex Network
in this field. Several theoretical models of network science were proposed and their topological and dynamical properties
are reviewed and compared with the other models. Our models mainly include a harmonious unifying hybrid preferential model,
a large unifying hybrid network model, a quantum interference network, a hexagonal nanowire network, and a small-world network
with the same degree. The models above reveal some new phenomena and findings, which are useful for deeply understanding and
investigating complex networks and their applications.
相似文献
38.
John H. Kalivas Joel B. Forrester Heather A. Seipel 《Journal of computer-aided molecular design》2004,18(7):537-547
Modeling quantitative structure–activity relationships (QSAR) is considered with an emphasis on prediction. An abundance of methods are available to develop such models. Using a harmonious approach that balances the bias and variance of predictions, the best calibration models are identified relative to the bias and variance criteria used. Criteria utilized to determine the adequacy of models are the root mean square error of calibration (RMSEC) and validation (RMSEV), respective R
2 values, and the norm of the regression vector. QSAR data from the literature are used to demonstrate concepts. For these data sets and criteria used, it is suggested that models obtained by ridge regression (RR) are more harmonious and parsimonious than models obtained by partial least squares (PLS) and principal component regression (PCR) when the data is mean-centered. The most harmonious RR models have the best bias/variance tradeoff reflected by the smallest RMSEC, RMSEV, and regression vector norms and the largest calibration and validation R
2 values. The most parsimonious RR models have the smallest effective rank. 相似文献
39.
40.
Robert Berke 《Discrete Mathematics》2010,310(3):561-569
We define by minc∑{u,v}∈E(G)|c(u)−c(v)| the min-costMC(G) of a graph G, where the minimum is taken over all proper colorings c. The min-cost-chromatic numberχM(G) is then defined to be the (smallest) number of colors k for which there exists a proper k-coloring c attaining MC(G). We give constructions of graphs G where χ(G) is arbitrarily smaller than χM(G). On the other hand, we prove that for every 3-regular graph G′, χM(G′)≤4 and for every 4-regular line graph G″, χM(G″)≤5. Moreover, we show that the decision problem whether χM(G)=k is -hard for k≥3. 相似文献